912B - New Year's Eve - CodeForces Solution


bitmasks constructive algorithms number theory *1300

Please click on ads to support us..

Python Code:

import sys
 
 
n, k = map(int, input().split())
 
if k == 1:
    print(n)
    sys.exit(0)
 
ans = 1
while ans < n:
    ans = ans * 2 + 1
 
print(ans)

C++ Code:

// Online C++ compiler to run C++ program online
#include <iostream>
using namespace std;
int main() {
    long long count=1;
    long long n,k;
    cin>>n>>k;
    long long old=n;
    while((n>>1)!=0){
        count++;
        n=n>>1;
    }
    // cout<<count<<endl;
    long long num=1;
    for(long long i=1;i<count;i++){
        num=(num<<1)^1;
    }
    if(k==1)cout<<old<<endl;
    else cout<<num<<endl;
    
    return 0;
}


Comments

Submit
0 Comments
More Questions

349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera